Rank-width is less than or equal to branch-width
نویسنده
چکیده
We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is 0 or 1. This implies that rank-width of a graph is less than or equal to branch-width of the graph unless the branch-width is 0. Moreover, this inequality is tight.
منابع مشابه
On the Boolean-Width of a Graph: Structure and Applications
Boolean-width is a recently introduced graph invariant. Similar to tree-width, it measures the structural complexity of graphs. Given any graph G and a decomposition of G of boolean-width k, we give algorithms solving a large class of vertex subset and vertex partitioning problems in time O∗(2O(k 2)). We relate the boolean-width of a graph to its branch-width and to the boolean-width of its inc...
متن کاملFast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width⋆
We consider the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rankwidth, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boolean-width. It compares well to the other four well-known width parameters tree-width, branch-width, clique-...
متن کاملBoolean-Width of Graphs
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is the runtime bottleneck when using a divide-and-conquer approach. Boolean-width is similar to rank-width, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boole...
متن کاملA Parametrized Algorithm for Matroid Branch-Width
Branch-width is a structural parameter very closely related to tree-width, but branch-width has an immediate generalization from graphs to matroids. We present an algorithm that, for a given matroid M of bounded branch-width t which is represented over a finite field, finds a branch decomposition of M of width at most 3t in cubic time. Then we show that the branch-width of M is a uniformly fixe...
متن کاملRank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)
We prove that every infinite sequence of skew-symmetric or symmetric matrices M1, M2, . . . over a fixed finite field must have a pair Mi, Mj (i < j) such that Mi is isomorphic to a principal submatrix of the Schur complement of a nonsingular principal submatrix in Mj , if those matrices have bounded rank-width. This generalizes three theorems on well-quasi-ordering of graphs or matroids admitt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 57 شماره
صفحات -
تاریخ انتشار 2008